Classical lambda calculus in modern dress
نویسنده
چکیده
Recent developments in the categorical foundations of universal algebra have given an impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott’s representation theorem is then completely natural and leads to a precise Fundamental Theorem showing the essential equivalence between the categorical and more familiar notions.
منابع مشابه
Explicit Substitutions and Intersection Types
Calculi of explicit substitutions have been introduced to give an account to the substitution process in lambda calculus. The idea is to introduce a notation for substitutions explicitely in the calculus. In other words one makes substitutions first class citizens whereas the classical lambda calculus leaves them in the meta-theory. Originally, the expression “explicit substitution” and the con...
متن کاملStrong normalization of a symmetric lambda calculus for second-order classical logic
We extend Barbanera and Berardi’s symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
متن کاملA foundational calculus for computing with streams
Computing with streams is a topic of increasing interest in modern computer science. Several proposals have suggested the use of programming languages and rewriting systems in order to formally describe programs computing over stream data. However, no stream calculus (in the sense of λ-calculus) has been exhibited for such studies yet. The challenge of providing a calculus for streams is to mak...
متن کاملTerms for Natural Deduction, Sequent Calculus and Cut Elimination in Classical Logic
This paper revisits the results of Barendregt and Ghilezan [3] and generalizes them for classical logic. Instead of λ-calculus, we use here λμ-calculus as the basic term calculus. We consider two extensionally equivalent type assignment systems for λμ-calculus, one corresponding to classical natural deduction, and the other to classical sequent calculus. Their relations and normalisation proper...
متن کاملDenotations for Classical Proofs - Preliminary Results
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (λ-LK→) whose inhabited types are exactly the implicative tautologies of classical logic and whose type assignment system is a classical sequent calculus. Intuitively, the terms of λ-LK→ correspond to constructs that are highly non-deterministic....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 27 شماره
صفحات -
تاریخ انتشار 2017